#!/usr/env/bin python
# -*- coding: utf-8 -*-

# @Time    : 2020-07-28 8:39 上午
# @Author  : yangdy
# @File    : 2020-07-28.104.二叉树的最大深度
# @Software: PyCharmCE
from my_methods import *
# Definition for a binary tree node.


class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None


class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if not root:
            return 0
        ld = self.maxDepth(root.left)
        rd = self.maxDepth(root.right)
        return (ld if ld > rd else rd) + 1


questions = [
    ()
]

